New variable neighbourhood search based 0-1 MIP heuristics

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Variable neighbourhood decomposition search for 0-1 mixed integer programs

In this paper we propose a new hybrid heuristic for solving 0-1 mixed integer programs based on the principle of variable neighbourhood decomposition search. It combines variable neighbourhood search with a general-purpose CPLEX MIP solver. We perform systematic hard variable fixing (or diving) following the variable neighbourhood search rules. The variables to be fixed are chosen according to ...

متن کامل

Constraint Directed Variable Neighbourhood Search

Local search algorithms operate by making small changes to candidate solutions with the aim of reaching new and improved solutions. The problem is that often the search will become trapped at sub optimal states from where there are no improving neighbours. Much research has gone into creating schemes to avoid these local optima and various strategies exist mainly based around altering the accep...

متن کامل

Single and parallel machine capacitated lotsizing and scheduling: New iterative MIP-based neighborhood search heuristics

We propose a general-purpose heuristic approach combining metaheuristics and Mixed Integer Programming to find high quality solutions to the challenging singleand parallel-machine capacitated lotsizing and scheduling problem with sequence-dependent setup times and costs. Commercial solvers fail to solve even medium-sized instances of this NP-hard problem, therefore heuristics are required to fi...

متن کامل

Variable neighbourhood search based heuristic for K-harmonic means clustering

Although there has been a rapid development of technology and increase of computation speeds, most of the real-world optimization problems still cannot be solved in a reasonable time. Some times it is impossible for them to be optimally solved, as there are many instances of real problems which cannot be addressed by computers at their present speed. In such cases, the heuristic approach can be...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: YUJOR

سال: 2015

ISSN: 0354-0243,1820-743X

DOI: 10.2298/yjor140219014h